The Design of Convivial Multiagent Systems
نویسندگان
چکیده
In this paper, we consider the design of convivial multiagent systems. Conviviality has recently been proposed as a social concept to develop multi-agent systems. In this paper we introduce temporal dependence networks to model the evolution of dependence networks and conviviality over time, we introduce epistemic dependence networks to combine the viewpoints of stakeholders, and we introduce normative dependence networks to model the transformation of social dependencies by hiding power relations and social structures to facilitate social interactions. We show how to use these visual languages in design, and we illustrate the design method using an example on virtual children adoptions.
منابع مشابه
Temporal dependence networks for the design of convivial multiagent systems
We show how to use TROPOS as a design methodology for convivial multi-agent systems. We introduce temporal dependence networks to measure the evolution of conviviality over time, and we compare them to dynamic dependence networks introduced for conviviality masks and internal dynamics.
متن کاملA Conviviality Measure for Early Requirement Phase of Multiagent System Design
In this paper, we consider the design of convivial multi-agent systems. Conviviality has recently been proposed as a social concept to develop multi-agent systems. In this paper we introduce temporal dependence networks to model the evolution of dependence networks and conviviality over time, we introduce epistemic dependence networks to combine the viewpoints of stakeholders, and we introduce ...
متن کاملAbout some specificities of embedded multiagent system design
Multiagent systems (MAS) satisfy to design requirements for open physical complex systems. However, up to now, no method allows to build software/hardware hybrid multiagent systems : we introduce the DIAMOND method.
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009